Terms Over Many Sorted Universal Algebra
نویسنده
چکیده
Let I be a non empty set, let X be a non-empty many sorted set indexed by I, and let i be an element of I. Note that X(i) is non empty. In the sequel S will be a non void non empty many sorted signature and V will be a non-empty many sorted set indexed by the carrier of S. Let us consider S, V . The functor S -Terms(V ) yielding a non empty subset of FinTrees(the carrier of DTConMSA(V )) is defined as follows: (Def.1) S -Terms(V ) = TS(DTConMSA(V )). Let us consider S, V . A term of S over V is an element of S -Terms(V ). In the sequel A denotes an algebra over S and t denotes a term of S over V . Let us consider S, V and let o be an operation symbol of S. Then Sym(o, V ) is a nonterminal of DTConMSA(V ). Let us consider S, V and let s1 be a nonterminal of DTConMSA(V ). A finite sequence of elements of S -Terms(V ) is called an argument sequence of s1 if: This article has been prepared during the visit of the author in Nagano in Summer 1994.
منابع مشابه
Terms over Many Sorted Universal Algebra 1
Pure terms (without constants) over a signature of many sorted universal algebra and terms with constants from algebra are introduced. Facts on evaluation of a term in some valuation are proved.] provide the notation and terminology for this paper. 1. Terms over a Signature and over an Algebra Let I be a non empty set, let X be a non-empty many sorted set indexed by I, and let i be an element o...
متن کاملTerms Over Many Sorted Universal Algebra 1 Grzegorz
Let I be a non empty set, let X be a non-empty many sorted set indexed by I, and let i be an element of I. Observe that X(i) is non empty. In the sequel S denotes a non void non empty many sorted signature and V denotes a non-empty many sorted set indexed by the carrier of S. Let us consider S and let V be a many sorted set indexed by the carrier of S. The functor S -Terms(V ) yielding a subset...
متن کاملMany Sorted Algebras
The basic purpose of the paper is to prepare preliminaries of the theory of many sorted algebras. The concept of the signature of a many sorted algebra is introduced as well as the concept of many sorted algebra itself. Some auxiliary related notions are defined. The correspondence between (1 sorted) universal algebras [8] and many sorted algebras with one sort only is described by introducing ...
متن کاملCircuit Generated by Terms and Circuit Calculating Terms
In the paper we investigate the dependence between the structure of circuits and sets of terms. Circuits in our terminology (see [19]) are treated as locally-finite many sorted algebras over special signatures. Such approach enables to formalize every real circuit. The goal of this investigation is to specify circuits by terms and, enentualy, to have methods of formal verification of real circu...
متن کاملAbstract Computability, Algebraic Specification and Initiality
Computability and Algebraic Specifications Abstract Abstract computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all absract computable functions on any many-sorted algebra; and (ii) all functions effectively approximable by abstract ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994